منابع مشابه
On syntax-directed adjoint fortran code
Gradients of high-dimensional functions can be computed efficiently and with machine accuracy by so-called adjoint codes. We present an L-attributed grammar for the single-pass generation of intraprocedural adjoint code for a subset of Fortran. Our aim is to integrate the syntaxdirected approach into the front-end of the NAGWare Fortran compiler. Research prototypes of this compiler that build ...
متن کاملSyntax-Directed Derivative Code (Part I: Tangent-Linear Code)
This is the first instance in a series of papers on single-pass generation of various types of derivative code by syntax-directed translation. We consider the automatic generation of tangent-linear code by forward mode automatic differentiation implemented as the bottom-up propagation of synthesized attributes on the abstract syntax tree. A proof-of-concept implementation is presented based on ...
متن کاملScalarizing Fortran 90 Array Syntax
Array syntax, existed in many languages, adds expressive power by allowing operations on and assignments to the array sections. When compiling to a uniprocessor machine, the array statement must be converted into a loop that maintains the correct semantics, by a process called scalarization. Scalarization presents a significant technical problem because an array assignment needs to be implement...
متن کاملGeneric Adaptive Syntax-Directed Compression for Mobile Code
We propose a new scheme for compressing mobile programs. Our proposal is meant as part of a larger infrastructure for code distribution and deployment. In this paper we show how to effectively compress programs on the source level by compressing abstract syntax trees (ASTs) which are equivalent to source code (modulo comments and layout). We compress ASTs by adapting the wellknown PPM (predicti...
متن کاملAdjoint Code Design Patterns
Adjoint methods have become fundamental ingredients of the scientific computing toolbox over the past decades. Large-scale parameter sensitivity analysis, uncertainty quantification and nonlinear optimization as well as modern approaches to deep learning would otherwise turn out computationally infeasible. For nontrivial real-world problems the algorithmic derivation of adjoint numerical simula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2007
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis0702047n